Resultants, Resolvents and the Computation of Galois Groups
نویسنده
چکیده
We will develop the machinery of resultants and resolvent polynomials with the ultimate goal of understanding the so-called “resolvent method” for computing Galois groups over Q. Along the way, we will encounter tangential applications of these tools, such as the determination of the minimal polynomial of, say, the sum of two algebraic numbers using resultants. In this way, this paper can serve at once as an exposition on computing Galois groups of rational polynomials and as an introduction to some techniques of computation in number fields.
منابع مشابه
Galois Theory and Reducible Polynomials
This paper presents works on reducible polynomials in Galois theory. It gives a fundamental theorem about the Galois ideals associated with a product of groups. These results are used for the practical determination of Galois groups of polynomials of degrees up to 7. : : :). The following tools are used: resolvents (relative or absolute), p-adic methods, Grr obner bases or block systems. In gen...
متن کاملComputation of the Galois Groups of the Resolvent Factors for the Direct and Inverse Galois Problems
In this paper we present a new method for determining the Galois group of a square free univariate polynomial. This method makes use of a priori computation of the Galois group of the factors of its resolvents, and can also be used for the Galois inverse problem.
متن کاملFormal Computation of Galois Groups with Relative Resolvents
We propound a systematic and formal method to compute the Galois group of a non-necessarily irreducible polynomial: we proceed by successive inclusions, using mostly computations on scalars (and very few on polynomials). It is based on a formal method of specialization of relative resolvents: it consists in expressing the generic coeecients of the resolvent using the powers of a primitive eleme...
متن کاملUsing Galois Ideals for Computing Relative Resolvents
Let k be a perfect field and k̄ an algebraic closure of k. Let f be a separable univariate polynomial of k[X] with degree n, and Ω be an ordered set of the n distinct roots of f in k̄. In Valibouze (1999) the notion of ideal of Ω-relations invariant by a subset L of the symmetric group of degree n is introduced. It generalizes the notion of ideal of relations and the notion of ideal of symmetric ...
متن کاملCalcul de résolvantes avec les modules de Cauchy
This paper gives a new and eecient algorithm in order to compute some characteristic polynomials using Cauchy modules. This algorithm is used for the computation of absolute resolvents and multi-resolvents which are essential tools in constructive Galois theory. formation de facteurs parasites, le polyn^ ome caract eristique d'un endomorphisme multi-plicatif associ e a un invariant quelconque d...
متن کامل